Clustering and Embedding Using Commute Times
نویسندگان
چکیده
منابع مشابه
Image Segmentation using Commute Times
This paper exploits the properties of the commute time to develop a graphspectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed ...
متن کاملRobust Outlier Detection Using Commute Time and Eigenspace Embedding
We present a method to find outliers using ‘commute distance’ computed from a random walk on graph. Unlike Euclidean distance, commute distance between two nodes captures both the distance between them and their local neighborhood densities. Indeed commute distance is the Euclidean distance in the space spanned by eigenvectors of the graph Laplacian matrix. We show by analysis and experiments t...
متن کاملEfficient large scale commute time embedding
Commute time embedding involves computing eigenfunctions of the graph Laplacian matrix. Spectral decomposition requires computational burden proportional to 3 ( ) O n , which may not be suitable for large scale dataset. This paper proposes computationally efficient commute time embedding by applying Nyström method to the normalized graph Laplacian. The performance of the proposed algorithms is ...
متن کاملCommute Times for a Directed Graph using an Asymmetric Laplacian
The expected commute times for a strongly connected directed graph are related to an asymmetric Laplacian matrix as a direct extension to similar well known formulas for undirected graphs. We show the close relationships between the asymmetric Laplacian and the so-called Fundamental matrix. We give bounds for the commute times in terms of the stationary probabilities for a random walk over the ...
متن کاملCommute times of random walks on trees
In this paper we provide exact formula for the commute times of random walks on spherically symmetric random trees. Using this formula we sharpen some of the results presented in Al-Awadhi et al to the form of equalities rather than inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2007
ISSN: 0162-8828
DOI: 10.1109/tpami.2007.1103